Decisional Diffie–Hellman assumption - PDFSEARCH.IO - Document Search Engine

Decisional Diffie–Hellman assumption
Results: 20

#	Item
11	3 Countermeasures Against Information Leakage 3-1 Subgroup Membership Problem and Its Applications to Information Security YAMAMURA Akihiro and SAITO Taiichi The widely used algorithmic problems, the quadratic residue pr Add to Reading List Source URL: www.nict.go.jp Language: English - Date: 2013-11-21 18:57:32 Group theory Decisional Diffie–Hellman assumption Pseudorandom generator theorem Order Commitment scheme Probabilistic encryption XTR Sylow theorems Abstract algebra Cryptography Mathematics
12	4-3 A Survey on Oblivious Transfer Protocols Le Trieu Phong In this paper, we survey some constructions of oblivious transfer (OT) protocols from public key encryption schemes. We begin with a simple construction of 1-o Add to Reading List Source URL: www.nict.go.jp Language: English - Date: 2013-11-21 21:07:55 Decisional Diffie–Hellman assumption Paillier cryptosystem XTR RSA ElGamal encryption Cryptography Public-key cryptography Oblivious transfer
13	Pairing-Based Cryptographic Protocols : A Survey Ratna Dutta, Rana Barua and Palash Sarkar Cryptology Research Group Stat-Math and Applied Statistics Unit 203, B. T. Road, Kolkata India[removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-06-24 08:19:14 Digital signature Diffie–Hellman problem Signcryption Group signature Blind signature ID-based encryption RSA Pairing Diffie–Hellman key exchange Cryptography BLS Decisional Diffie–Hellman assumption
14	Initiator-Resilient Universally Composable Key Exchange Dennis Hofheinz, J¨orn M¨ uller-Quade, and Rainer Steinwandt IAKS, Arbeitsgruppe Systemsicherheit, Prof. Dr. Th. Beth, Fakult¨ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-11-25 06:20:23 Diffie–Hellman key exchange Public-key cryptography Diffie–Hellman problem Decisional Diffie–Hellman assumption XTR Internet Key Exchange Commitment scheme Cryptography Cryptographic protocols Universal composability
15	Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs Carmit Hazay∗ Abstract In this paper we study the two fundamental functionalities oblivious polynomial evaluation in the Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-01-03 11:03:18 Oblivious transfer Secure multi-party computation Decisional Diffie–Hellman assumption ElGamal encryption XTR IP Degree of a polynomial Proof of knowledge Cryptography Cryptographic protocols Polynomials
16	An Investigation of Some Forward Security Properties for PEKS and IBE Qiang Tang APSIA group, SnT, University of Luxembourg 6, rue Richard Coudenhove-Kalergi, L-1359 Luxembourg [removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-07-17 11:29:53 Symbol Decisional Diffie–Hellman assumption Applied mathematics Cyberwarfare Mathematics Cryptography Public-key cryptography Ciphertext indistinguishability
17	Advances in Cryptology – Proceedings of Crypto ’07 (August 19–[removed], Santa Barbara, CA) A. Menezes Ed. Springer-Verlag, LNCS 4622, pages 482–499. A generalization of DDH with applications to protocol analysis a Add to Reading List Source URL: www.ssi.gouv.fr Language: English - Date: 2012-11-06 05:29:19 Decisional Diffie–Hellman assumption Mathematics Diffie–Hellman problem XTR Diffie–Hellman key exchange Computational Diffie–Hellman assumption Computational hardness assumptions Finite fields Cryptographic protocols
18	Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-10-16 13:57:22 Pseudorandomness Computational hardness assumptions Pseudorandom number generators Algorithmic information theory Pseudorandom generator Naor-Reingold Pseudorandom Function Decisional Diffie–Hellman assumption Pseudorandom function family Randomized algorithm Cryptography Theoretical computer science Applied mathematics
19	In Advances in Cryptology—CRYPTO ’99, Vol[removed]of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp[removed]A Simple Publicly Verifiable Secret Sharing Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2001-04-03 10:12:09 Public-key cryptography Publicly Verifiable Secret Sharing Finite fields Verifiable secret sharing Secret sharing ElGamal encryption Diffie–Hellman key exchange Diffie–Hellman problem Decisional Diffie–Hellman assumption Cryptography Cryptographic protocols Computational hardness assumptions
20	Workshop on Selected Areas in Cryptography[removed] – 16 august 2002, St. John’s, Newfoundland, Canada) H. Heys and K. Nyberg Eds. Springer-Verlag, LNCS 2595, pages 325–338 Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2007-07-06 16:33:16 Finite fields Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Hellman ElGamal encryption Whitfield Diffie XDH assumption Cryptography Computational hardness assumptions Cryptographic protocols